On the maximum edge biclique packing problem: formulations and computational experiments

A biclique is a complete bipartite graph. Given a (L,R)-bipartite graph G = (V,E) and a positive integer k, the maximum edge biclique packing (mebp) problem consists in finding a set of at most k bicliques, subgraphs of G, such that the bicliques are vertex disjoint with respect to a subset S ⊆ V and the number of edges inside the bicliques is maximized. The maximum edge biclique (meb) problem is a special case of the mebp problem in which k is fixed as 1. Several applications of the meb problem have been studied and, in this paper, we describe applications of the mebp problem in metabolic networks and product bundling. In these applications the input graphs are very unbalanced (i.e. |R| is considerably greater than |L|), thus we consider carefully this property in our models. We introduce a new formulation for the meb problem and a branch-and-price scheme for the mebp problem. Finally, we present computational experiments with instances that come from the described applications and also with randomly generated instances.